On stateless multihead automata: Hierarchies and the emptiness problem
نویسندگان
چکیده
منابع مشابه
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملThe Emptiness Problem for Automata on Infinite Trees
The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to that for automata on finite trees, by showing that any automata definable set of infinite trees must contain a finitelygenerable tree. Section 1: Introduction The analysis of fin...
متن کاملOn the Regular Emptiness Problem of Subzero Automata
In the fundamental paper [5] Rabin proved that the monadic second order logic (MSO) of the full binary tree is decidable using the automata method. This proof technique can be roughly described as follows: (1) an appropriate notion of tree automaton is defined; (2) every formula φ of the MSO logic is effectively associated to an automaton Aφ such that that φ is true if and only if Aφ accepts a ...
متن کاملHierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages
We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our Watson-Crick counter machines are biologically motivated. They have two heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads, i.e., every letter of ...
متن کاملOn Pebble Automata for Data Languages with Decidable Emptiness Problem
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.09.001